Search results for "Ordered set"
showing 10 items of 30 documents
Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems
2016
Mixed integer optimal compensation deals with optimization problems with integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls could lead to intractability in problems of large dimensions. To address this challenge, we introduce a decomposition method which turns the original n-dimensional optimization problem into n independent scalar problems of lot sizing form. Each of these problems can be viewed as a two-player zero-sum game, which introduces some element of conservatism. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon, a step that mirro…
Fixed point theorems on ordered metric spaces and applications to nonlinear elastic beam equations
2012
In this paper, we establish certain fixed point theorems in metric spaces with a partial ordering. Presented theorems extend and generalize several existing results in the literature. As application, we use the fixed point theorems obtained in this paper to study existence and uniqueness of solutions for fourth-order two-point boundary value problems for elastic beam equations.
Spaces of typen on partially ordered sets
1989
This paper contains a generalized approach to incidence geometry on partially ordered sets. A difference to the usual geometrical concepts is that points may have different size. Our main result states that a large class of spaces allows lattice theoretic characterizations. Especially, a generalized version of the Veblen-Young axiom of projective geometry has a lattice theoretic equivalent, called then-generation property (which is a generalization of the ‘Verbindungssatz’). Modularity and distributivity of a lattice of subspaces are reflected in the underlying space. Finally we give specializations and examples.
Completion of partially ordered sets
2007
The complex of words and Nakaoka stability
2005
We give a new simple proof of the exactness of the complex of injective words and use it to prove Nakaoka's homology stability for symmetric groups. The methods are generalized to show acyclicity in low degrees for the complex of words in "general position". Hm(§ni1;Z) = Hm(§n;Z) for n=2 > m where §n denotes the permutation group of n elements. An elementary proof of this fact has not been available in the literature. In the first section the complex C⁄(m) of abelian groups is studied which in de- gree n is freely generated by injective words of length n. The alphabet consists of m letters. The complex C⁄(m) has the only non vanishing homology in degree m (Theorem 1). This is a result of F.…
Public communication of emerging sciences and technologies. Problems and challenges in the case of nanotechnology
2014
This work deals with public understanding of nanoscience and nanotechnology. Concerns about public attitudes towards both, including a lack of knowledge on the part of the general public, have lead scholars in a number of countries to conduct early studies on the social perceptions of these fields. However, this has not been the case in Spain or Latin America, where studies on the popularisation and public understanding of nanotechnology are almost non-existent. This work has a double aim. First, it seeks to contextualise and explain the Spanish situation in this regard. Second, it aims to communicate the results of a Delphi study involving nanotechnology experts (n=38) and designed to fill…
Inductive Inference with Procrastination: Back to Definitions
1999
In this paper, we reconsider the definition of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate possibility of using arbitrary linearly ordered sets to bound mindchanges in similar way. It turns out that using certain ordered sets it is possible to define inductive inference types different from the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
Coupled fixed point, F-invariant set and fixed point of N-order
2010
In this paper, we establish some new coupled fixed point theorems in complete metric spaces, using a new concept of $F$-invariant set. We introduce the notion of fixed point of $N$-order as natural extension of that of coupled fixed point. As applications, we discuss and adapt the presented results to the setting of partially ordered cone metric spaces. The presented results extend and complement some known existence results from the literature.
Ordering and Convex Polyominoes
2005
We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order. In particular we consider the families of polyominoes and convex polyominoes and the family, recently introduced by the authors, of L-convex polyominoes. In the first part of the paper we study the closure properties of such families with respect to the order. In particular we obtain a new characterization of L-convex polyominoes: a discrete set P is a L-convex polyomino if and only if all the elements Q≼P are polyominoes. In the seco…
Meir-Keeler Type Contractions for Tripled Fixed Points
2012
Abstract In 2011, Berinde and Borcut [6] introduced the notion of tripled fixed point in partially ordered metric spaces. In our paper, we give some new tripled fixed point theorems by using a generalization of Meir-Keeler contraction.